Stationary Points of Bound Constrained Minimization Reformulations of Complementarity Problems
نویسنده
چکیده
We consider two merit functions which can be used for solving the nonlinear complementarity problem via nonnegatively constrained minimization. One of the functions is the restricted implicit Lagrangian (Refs. 1-3), and the other appears to be new. We study the conditions under which a stationary point of the minimization problem is guaranteed to be a solution of the underlying complementarity problem. It appears that, for both formulations, the same regularity condition is needed. This condition is closely related to the one used in Ref. 4 for unrestricted implicit Lagrangian. Some new sufficient conditions are also given.
منابع مشابه
Box-constrained minimization reformulations of complementarity problems in second-order cones
Reformulations of a generalization of a second-order cone complementarity problem (GSOCCP) as optimization problems are introduced, that preserve differentiability. Equivalence results are proved in the sense that the global minimizers of the reformulations with zero objective value are solutions to the GSOCCP and vice versa. Since the optimization problems involved include only simple constrai...
متن کاملSome Optimization Reformulations of the Extended Linear Complementarity Problem
We consider the extended linear complementarity problem (XLCP) introduced by Mangasarian and Pang [22], of which the horizontal and vertical linear complementarity problems are two special cases. We give some new sufficient conditions for every stationary point of the natural bilinear program associated with XLCP to be a solution of XLCP. We further propose some unconstrained and bound constrai...
متن کاملStochastic Generalized Complementarity Problems in Second-Order Cone: Box-Constrained Minimization Reformulation and Solving Methods
In this paper, we reformulate the stochastic generalized second-order cone complementarity problems as boxconstrained optimization problems. If satisfy the condition that the reformulation’s objective value is zero, the solutions of box-constrained optimization problems are also solutions of stochastic generalized second-order cone complementarity problems. Since the box-constrained minimizatio...
متن کاملSolution of linear complementarity problems using minimization with simple bounds
We deene a minimization problem with simple bounds associated to the horizontal linear complementarity problem (HLCP). When the HLCP is solvable, its solutions are the global minimizers of the associated problem. When the HLCP is feasible, we are able to prove a number of properties of the stationary points of the associated problem. In many cases, the stationary points are solutions of the HLC...
متن کاملNew Reformulations and Smoothed Penalty Method for Stochastic Nonlinear Complementarity Problems
We consider the stochastic nonlinear complementarity problem (SNCP), which has been receiving much attention in the recent optimization world. We first formulate the problem as a stochastic mathematical program with equilibrium constraints (SMPEC) and then, in order to develop some efficient methods, we further give some reformulations of the SNCP. In particular, for the case where the random v...
متن کامل